Rush Hour is PSPACE-complete
نویسنده
چکیده
In this report we give a formal definition of the sliding block puzzle Rush Hour and we report on the proof showing that Rush Hour is PSPACE-complete from “The nondeterministic constraint logic model of computation: Reductions and applications” by Hearn and Demaine (Proceedings ICALP 2002).
منابع مشابه
On the parameterized complexity of the generalized rush hour puzzle
We consider the parameterized complexity of a generalized version of the game Rush Hour , which is a puzzle requiring the player to find a sequence of moves by vehicles to enable a special target vehicle to escape from a grid-shaped game board that may contain obstacles. Although the problem is PSPACE-complete, we demonstrate algorithms that work in polynomial time when either the total number ...
متن کاملPSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
We present a nondeterministic model of computation based on reversing edge directions in weighted directed graphs with minimum in-flow constraints on vertices. Deciding whether this simple graph model can be manipulated in order to reverse the direction of a particular edge is shown to be PSPACEcomplete by a reduction from Quantified Boolean Formulas. We prove this result in a variety of specia...
متن کاملThe Nondeterministic Constraint Logic Model of Computation: Reductions and Applications
We present a nondeterministic model of computation based on reversing edge directions in weighted directed graphs with minimum in-flow constraints on vertices. Deciding whether this simple graph model can be manipulated in order to reverse the direction of a particular edge is shown to be PSPACEcomplete by a reduction from Quantified Boolean Formulas. We prove this result in a variety of specia...
متن کاملA Structural Complexity Measure for Predicting Human Planning Performance
Humans have an impressive ability to solve even computationally complex problems. Limited cognitive processing capabilities, however, impede an exhaustive search of the problem space. Thus, planning problems of the same size may require a different cognitive effort. Formal complexity aspects are inherent to a problem and set computational limits that a solver must deal with. For a measure of co...
متن کاملParameterized Complexity of Graph Constraint Logic
Graph constraint logic is a framework introduced by Hearn and Demaine [6], which provides several problems that are often a convenient starting point for reductions. We study the parameterized complexity of Constraint Graph Satisfiability and both bounded and unbounded versions of Nondeterministic Constraint Logic (NCL) with respect to solution length, treewidth and maximum degree of the underl...
متن کامل